FPGA Implementation of Modified Montgomery for RSA Cryptosystem
نویسندگان
چکیده
Modular multiplication is a key operation in public key cryptosystems like RSA. Among modular multiplication methods, Montgomery modular multiplication is an efficient algorithm suitable for hardware implementation. In this paper, a Modified Montgomery Modular Multiplication design is proposed with carry save adder architecture and parallel simplified quotient computation for the next iteration. The proposed design has a high clock frequency and high throughput. The proposed design and RSA are implemented on Virtex 2 and Virtex 5 FPGAs.
منابع مشابه
Modified Montgomery for RSA Cryptosystem
Encryption and decryption in RSA are done by modular exponentiation which is achieved by repeated modular multiplication. Hence efficiency of modular multiplication directly determines the efficiency of RSA cryptosystem. This paper designs a Modified Montgomery Modular Multiplication in which addition of operands is computed by 4:2 compressor. The basic logic operations in addition are partitio...
متن کاملFPGA Implementation of Modular Exponentiation for RSA Cryptosystem
In this paper, the implementation of RSA (Rivest, Shamir and Adleman) cryptosystem using Hardware/Software (HW/SW) co-design approach is presented. The main function of RSA is the Modular Exponentiation (ME) which is accomplished by repeated Modular Multiplications (MM’s) on large integers. In this work, we propose the implementation of the ME as a Programmable System on Chip (PSoC), using the ...
متن کاملRSA & Public Key Cryptography in FPGAs
In this paper an RSA calculation architecture is proposed for FPGAs that addresses the issues of scalability, flexible performance, and silicon efficiency for the hardware acceleration of Public Key crypto systems. Using techniques based around Montgomery math for exponentiation, the proposed RSA calculation architecture is compared to existing FPGA-based solutions for speed, FPGA utilisation, ...
متن کاملHigh Speed Systolic Montgomery Modular Multipliers for RSA Cryptosystems
Montgomery modular multiplication is one of the most important and frequently used techniques to accelerate the time consuming mathematical operations used in RSA cryptosystems. In this paper, a modified Montgomery modular multiplication algorithm is presented where the carry-save operations are split into two cycles so as to eliminate the generation of the data-dependent control signal from do...
متن کاملFPGA Implementation of Modular Exponentiation Using Single Modular Multiplier
This paper presents the FPGA implementation of Modular Exponentiation (ME), based on Software/Hardware (SW/HW) approach. Indeed, in Rivest, Shamir and Adleman (RSA) cryptosystem, ME which is computed by series of Modular Multiplications (MM’s), is the main function to encrypt and decrypt data. In order to achieve the best trade-off between area, speed and flexibility, we propose in this work an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013